A Free Construction of Kleene Algebras with Tests
نویسنده
چکیده
In this paper we define Kleene algebra with tests in a slightly more general way than Kozen’s definition. Then we give an explicit construction of the free Kleene algebra with tests generated by a pair of sets. Moreover we show that our free Kleene algebra with tests is isomorphic to Kozen and Smith’s Kleene algebra with tests if their construction available, that is, a generator of the Boolean algebra is finite. Finally, we show that an infinitely-generated free Kleene algebra with tests in the sense of Kozen can be obtained from our Free algebra.
منابع مشابه
On the Representation of Kleene Algebras with Tests
We investigate conditions under which a given Kleene algebra with tests is isomorphic to an algebra of binary relations. Two simple separation properties are identified that, along with star-continuity, are sufficient for nonstandard relational representation. An algebraic condition is identified that is necessary and sufficient for the construction to produce a standard representation.
متن کاملProgram Construction and Verification Components Based on Kleene Algebra
Variants of Kleene algebra support program construction and verification by algebraic reasoning. This entry provides a verification component for Hoare logic based on Kleene algebra with tests, verification components for weakest preconditions and strongest postconditions based on Kleene algebra with domain and a component for step-wise refinement based on refinement Kleene algebra with tests. ...
متن کاملOn the Expressive Power of Kleene Algebra with Domain
It is shown that antidomain semirings are more expressive than test semirings and that Kleene algebras with domain are more expressive than Kleene algebras with tests. It is also shown that Kleene algebras with domain are expressive for propositional Hoare logic whereas Kleene algebras with tests are not.
متن کاملKleene Algebra with Tests
Kleene algebras with tests provide a rigorous framework for equational speciication and veriication. They have been used successfully in basic safety analysis, source-to-source program transformation, and concurrency control. We prove the completeness of the equational theory of Kleene algebra with tests and *-continuous Kleene algebra with tests over language-theoretic and relational models. W...
متن کاملParacategories I: internal paracategories and saturated partial algebras
Based on the monoid classifier ∆, we give an alternative axiomatization of Freyd’s paracategories, which can be interpreted in any bicategory of partial maps. Assuming furthermore a free-monoid monad T in our ambient category, and coequalisers satisfying some exactness conditions, we give an abstract envelope construction, putting paramonoids (and paracategories) in the more general context of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004